/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param root TreeNode类 
     * @param sum int整型 
     * @return bool布尔型
     */
    bool hasPathSum(TreeNode* root, int sum) {
        if(!root) return false;
        if(sum == root->val && !root->left && !root->right) return true;
        if(hasPathSum(root->left, sum-root->val)) return true;
        if(hasPathSum(root->right, sum-root->val)) return true;
        return false;
    }
};